THE FLUTED FRAGMENT REVISITED
نویسندگان
چکیده
منابع مشابه
Quine's Fluted Fragment is Non-Elementary
We study the fluted fragment, a decidable fragment of first-order logic with an unbounded number of variables, originally identified by W.V. Quine. We show that the satisfiability problem for this fragment has non-elementary complexity, thus refuting an earlier published claim by W.C. Purdy that it is in NExpTime. More precisely, we consider, for all m greater than 1, the intersection of the fl...
متن کاملThe Two-Variable Fragment with Counting Revisited
The satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting were shown in [5] to be in NExpTime. This paper presents a simplified proof via a result on integer programming due to Eisenbrand and Shmonina [2].
متن کاملTapered, Fluted Femoral Fixation
CLINICAL/SURGICAL PEARLS: 1. Determining the highest level of supportive femoral bone is important to place the taper into this bone. An extended trochanteric osteotomy is useful for removal of the old stem and facilitates placement of a relatively straight, tapered, fluted stem down a bowed femur, thus preventing anterior perforation of the stem through the anterior cortex. The intact diaphysi...
متن کاملFluted Formulas and the Limits of Decidability
In the predicate calculus, variables provide a flexible indexing service that selects the actual arguments to a predicate letter from among possible arguments that precede the predicate letter (in the parse of the formula). In the process of selection, the possible arguments can be permuted, repeated (used more than once), and skipped. If this serviCe is withheld, so that arguments must be the ...
متن کاملQUICKSELECT Revisited
We give an overview of the running time analysis of the random divide-and-conquer algorithm FIND or QUICKSELECT. The results concern moments, distribution of FIND’s running time, the limiting distribution, a stochastic bound and the key: a stochastic fixed point equation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Symbolic Logic
سال: 2019
ISSN: 0022-4812,1943-5886
DOI: 10.1017/jsl.2019.33